Erdős–Szekeres-type statements: Ramsey function and decidability in dimension 1
نویسندگان
چکیده
منابع مشابه
Unprovable Ramsey-type statements reformulated to talk about primes
Let us say that two finite sets of natural numbers are primality-isomorphic if there is a differencepreserving primality-preserving and nonprimality-preserving bijection between them. Let Φ be the statement “every infinite set B ⊆ N has an infinite subset A such that for any x < y < z in A, the interval { 2 , . . . , 3x+y 2 } is primality-isomorphic to the interval { 2 , . . . , 3x+z 2 }”. We p...
متن کاملParametrized Ramsey theorems in infinite dimension∗
In certain circumstances, one-dimensional parametrized Ramsey theorems extend to infinite dimension. As a consequence, countable products of many forcings do not add splitting reals.
متن کاملA note on propositional proof complexity of some Ramsey-type statements
Any valid Ramsey statement n −→ (k)2 can be encoded into a DNF formula RAM(n, k) of size O(nk) and with terms of size (k 2 ) . Let rk be the minimal n for which the statement holds. We prove that RAM(rk, k) requires exponential size constant depth Frege systems, answering a problem of Krishnamurthy and Moll [15]. As a consequence of Pudlák’s work in bounded arithmetic [19] it is known that ther...
متن کامل: metadiscourse in introduction sections of applied linguistics and physics research articles: exploring variation in frequency and type
abstract in written mode of language, metadiscourse markers are used commonly to help writers in general and academic writers in particular to produce coherent and professional texts. the purpose of the present study was to compare introduction sections of applied linguistics and physics articles regarding their use of interactive and interactional metadiscourse markers based on the model pro...
15 صفحه اولOn Ramsey-type theorems
In [21], Frank Plumpton Ramsey proved what has turned out to be a remarkable and important theorem which is now known as Ramsey's theorem. This result is a generalization of the pigeonhole principle and can now be seen as part of a family of theorems of the same flavour. These Ramsey-type theorems all have the common feature that they assert, in some precise combinatorial way, that if we deal w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Duke Mathematical Journal
سال: 2014
ISSN: 0012-7094
DOI: 10.1215/00127094-2785915